def factorial(n):
    result = n
    for i in range(1,n):
        result *= i
    return result

number = int(input('请输入一个正整数：'))

result = factorial(number)
print("%d 的普通方法阶乘是:%d" %(number , result))

def factorial_recu(n):
    if n == 1:
        return 1
    return n * factorial_recu(n - 1)

result2 = factorial_recu(number)
print("%d 的递归方法阶乘是:%d" %(number , result))

def fibonacci(n):
    if n == 1 or n == 2:
        return 1
    return fibonacci(n - 1) + fibonacci(n - 2)
result3 = fibonacci(number)
print('%d 的斐波那契数列为：%d' %(number , result3))